Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art
نویسندگان
چکیده
Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented – Ant Colony System and MAX -MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or neighborhood definition), and a reference random restart local search algorithm. Further, both ant algorithms are compared on an additional set of instances. Conclusions are drawn about the performance of ant algorithms on timetabling problems in comparison to other metaheuristics. Also the design, implementation, and parameters of ant algorithms solving the university course timetabling problem are discussed. It is shown that the particular implementation of an ant algorithm has significant influence on the observed algorithm performance.
منابع مشابه
Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملUniversity Course Timetabling Using ACO: A Case Study on Laboratory Exercises
The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...
متن کاملA MAX-MIN Ant System for the University Course Timetabling Problem
We consider a simplification of a typical university course timetabling problem involving three types of hard and three types of soft constraints. A MAX -MIN Ant System, which makes use of a separate local search routine, is proposed for tackling this problem. We devise an appropriate construction graph and pheromone matrix representation after considering alternatives. The resulting algorithm ...
متن کاملGenerating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کاملارایه یک مدل ریاضی جدید جهت برنامه ریزی جدول زمان بندی دروس دانشگاهی بر اساس کیفیت ارایه دروس
One of the important tasks of universities that are usually challenging is university course timetabling problem. They are faced with this problem every year and every term and which is directly effective on education performance. In the university course timetabling problem, the university sources including lessons, lecturers, classes and other teaching sources are assigned to a series of time...
متن کامل